TR-2002014: Iterative Inversion of Structured Matrices
نویسندگان
چکیده
Iterative processes for the inversion of structured matrices can be further improved by using a technique for compression and refinement via the least-squares computation. We review such processes and elaborate upon incorporation of this technique into the known frameworks.
منابع مشابه
Iterative inversion of structured matrices
Iterative processes for the inversion of structured matrices can be further improved by using a technique for compression and refinement via the least-squares computation. We review such processes and elaborate upon incorporation of this technique into the known frameworks.
متن کاملTR-2009008: Randomized Preprocessing of Homogeneous Linear Systems of Equations
Our randomized preprocessing enables pivoting-free and orthogonalization-free solution of homogeneous linear systems of equations, which leads to significant acceleration of the known algorithms in the cases of both general and structured input matrices. E.g., in the case of Toeplitz inputs, we decrease the estimated solution time from quadratic to nearly linear, and our tests show dramatic dec...
متن کاملImprovements of two preconditioned AOR iterative methods for Z-matrices
In this paper, we propose two preconditioned AOR iterative methods to solve systems of linear equations whose coefficient matrices are Z-matrix. These methods can be considered as improvements of two previously presented ones in the literature. Finally some numerical experiments are given to show the effectiveness of the proposed preconditioners.
متن کاملComputing the Matrix Geometric Mean of Two HPD Matrices: A Stable Iterative Method
A new iteration scheme for computing the sign of a matrix which has no pure imaginary eigenvalues is presented. Then, by applying a well-known identity in matrix functions theory, an algorithm for computing the geometric mean of two Hermitian positive definite matrices is constructed. Moreover, another efficient algorithm for this purpose is derived free from the computation of principal matrix...
متن کاملTR-2011002: Symbolic Lifting for Structured Linear Systems of Equations: Numerical Initialization, Nearly Optimal Boolean Cost, Variations, and Extensions
Hensel’s symbolic lifting for a linear system of equations and numerical iterative refinement of its solution have striking similarity. Combining the power of lifting and refinement seems to be a natural resource for further advances, but turns out to be hard to exploit. In this paper, however, we employ iterative refinement to initialize lifting. In the case of Toeplitz, Hankel, and other popu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016